Iterated full information secretary problem
نویسندگان
چکیده
منابع مشابه
The Submodular Secretary Problem
Online auction is an essence of many modern markets, particularly networked markets, in which information about goods, agents, and outcomes is revealed over a period of time, and the agents must make irrevocable decisions without knowing future information. Optimal stopping theory, especially the classic secretary problem, is a powerful tool for analyzing such online scenarios which generally r...
متن کاملThe Secretary Problem
This note reanalyzes a non·zero-sum game version of the secretary problem recently treated by Kurano, Nakagami and Yasuda [3], under a modified formulation of the problem. The equilibrium derived differs from the former one and has an interesting assymptotic behavior which reconfirms a main theorem formerly proved by Presman and Sonin [4]. Th" equilibrium value in the limit is a positive number...
متن کاملThe Temp Secretary Problem
We consider a generalization of the secretary problem where contracts are temporary, and for a fixed duration γ. This models online hiring of temporary employees, or online auctions for re-usable resources. The problem is related to the question of finding a large independent set in a random unit interval graph.
متن کاملOn a Competitive Secretary Problem
Consider a scenario in which there are multiple employers competing to hire the best possible employee. How does the competition between the employers affect their hiring strategies or their ability to hire one of the best possible candidates? In this paper, we address this question by studying a generalization of the classical secretary problem from optimal stopping theory: a set of ranked emp...
متن کاملThe Postdoc Variant of the Secretary Problem
The classical secretary problem involves sequentially interviewing a pool of n applicants with the aim of hiring exactly the best one in the pool—nothing less is good enough. The optimal decision strategy is easy to describe and the probability of success is 1/e. In this paper, we consider a minor variant of this classical problem. We wish to pick not the best but the second best (the best is g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Methods of Operations Research
سال: 2017
ISSN: 1432-2994,1432-5217
DOI: 10.1007/s00186-017-0594-0